Acyclic colorings of products of trees
نویسندگان
چکیده
We obtain bounds for the coloring numbers of products of trees for three closely related types of colorings: acyclic, distance 2, and L(2, 1).
منابع مشابه
Acyclic Colorings of Products of Cycles
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of products of paths and cycles are considered. We determine the acyclic chromatic numbers of three such products: grid graphs...
متن کاملOn acyclic colorings of direct produts
A coloring of a graph G is an acyclic coloring if the union of any two color classes induces a forest. It is proved that the acyclic chromatic number of direct product of two trees T1 and T2 equals min{∆(T1)+1, ∆(T2)+1}. We also prove that the acyclic chromatic number of direct product of two complete graphs Km and Kn is mn − m − 2, where m ≥ n ≥ 4. Several bounds for the acyclic chromatic numb...
متن کاملAcyclic and Star Colorings of Joins of Graphs and an Algorithm for Cographs (Extended Abstract)
compiled April 30, 2009 from draft version hg:e0660c153c0b:79 An acyclic coloring of a graph is a proper vertex coloring such that the subgraph induced by the union of any two color classes is a disjoint collection of trees. The more restricted notion of star coloring requires that the union of any two color classes induces a disjoint collection of stars. The acyclic and star chromatic numbers ...
متن کاملOn the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of Hamming graphs, products of complete graphs, are considered.
متن کاملAcyclic and Star Colorings of Cographs
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star coloring requires that the union of any two color classes induces a disjoint collection of stars. We prove that every acyclic coloring of a cograph is also a star coloring and give a linear-time algorithm for finding a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 99 شماره
صفحات -
تاریخ انتشار 2006